Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic
نویسندگان
چکیده
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
منابع مشابه
Kevin Compton , Jean - Eric Pin , Wolfgang Thomas ( editors ) : Automata Theory : Infinite Computations
s of Talks Page I. Automata and Infinite Sequences 6 Ch. Frougny (Paris): Rational 0)-Relations, Application to the Representation of Real Numbers J. Karhuméiki (Turku): Finite Automata Computing Real Functions N. Klarlund (Aarhus): Progress Measures for Complementation of to-Automata B. Le Saec (Bordeaux): A Syntactic Approach to Deterministic to-Automata D. Perrin (Paris): to-Automata with Mu...
متن کاملThe monadic theory of finite representations of infinite words
In this paper, we consider existential monadic second-order logic (monadic Σ1) on finite unary graphs, that is finite graphs with functional edge relation. These can be seen as finite encodings of ultimately periodic words. We show that, on these graphs, the bisimulation invariant fragment of monadic Σ1 equals the bisimulation invariant fragment of monadic second order logic itself, and that MS...
متن کاملMonadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-width and clique-width. It will review applications to the construction of algorithms, to Graph Theory and to the extension to graphs of Formal Language Theory concepts. We first explain the role of Logic. A graph, eith...
متن کاملDistributed Graph Automata and Verification of Distributed Algorithms
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deterministic, we also obtain two strictly weaker variants of our automata for which the emptiness problem is decidable. As an ...
متن کاملA Hierarchical Approach to Graph Automata and Monadic Second-Order Logic over Graphs
A hierarchical approach to the decomposition of graphs is introduced which is related to the notion of tree decomposition. On this basis a hierarchical automaton model for graphs is deened. We show that this automaton model is (relative to an appropriate class of graphs) equivalent to monadic second-order logic in expressive power, properly strengthening previous results on monadic second-order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012